Incomplete block matrix factorization preconditioning methods. The ultimate answer?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incomplete block factorization preconditioning for indefinite elliptic problems

The application of the finite difference method to approximate the solution of an indefinite elliptic problem produces a linear system whose coefficient matrix is block tridiagonal and symmetric indefinite. Such a linear system can be solved efficiently by a conjugate residual method, particularly when combined with a good preconditioner. We show that specific incomplete block factorization exi...

متن کامل

Preconditioning with Matrix Factorization

Pietsch Factorization and Grothendieck Factorization are the two landmark theorems in modern functional analysis. They were first introduced to the numerical linear algebra community by the work of Joel A. Tropp in the column subset selection problem, which seeks to extract from a matrix a column submatrix that has lower spectral norm. Despite their broad application in functional analysis, the...

متن کامل

Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation

The application of the finite difference method to discretize the complex Helmholtz equation on a bounded region in the plane produces a linear system whose coefficient matrix is block tridiagonal and is some (complex) perturbation of an M-matrix. The matrix is also complex symmetric, and its real part is frequently indefinite. Conjugate gradient type methods are available for this kind of line...

متن کامل

Preconditioning By Incomplete Block Cyclic Reduction

Iterative methods for solving linear systems arising from the discretization of elliptic/parabolic partial differential equations require the use of preconditioners to gain increased rates of convergence. Preconditioners arising from incomplete factorizations have been shown to be very effective. However, the recursiveness of these methods can offset these gains somewhat on a vector processor. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1985

ISSN: 0377-0427

DOI: 10.1016/0377-0427(85)90004-4